char* longestCommonPrefix(char** strs, int strsSize)
{
    int index = 0;
    char* str = (char*)malloc(sizeof(char) * 250);
    str[index] = '\0';
    int num = 0;
    for (int i = 0; strs[0][i] != '\0'; i++)
    {
        bool find = false;
        for (int j = 1; j < strsSize; j++)
        {
            if (strs[j][num] == '\0' || strs[j][num] != strs[0][num])
            {
                str[index] = '\0';
                return str;
            }
        }
        str[index++] = strs[0][num++];
    }
    str[index] = '\0';
    return str;
}